An optimal boundary fair scheduling algorithm for multiprocessor real-time systems
نویسندگان
چکیده
منابع مشابه
An optimal boundary fair scheduling algorithm for multiprocessor real-time systems
With the emergence of multicore processors, the research on multiprocessor real-time scheduling has caught more researchers’ attention recently. Although the topic has been studied for decades, it is still an evolving research field with many open problems. In this work, focusing on periodic real-time tasks with quantum-based computation requirements and implicit deadlines, we propose a novel o...
متن کاملAn Optimal Multiprocessor Real-Time Scheduling Algorithm
An optimal scheduling algorithm is described that feasibly schedules a set of m periodic tasks on n processors before their respective deadlines, if the task set satisses certain conditions. The complexity of this scheduling algorithm in terms of the number of scheduled tasks and the number of processors and upper bounds on the number of preemptions in a given time interval and for any single t...
متن کاملTechnical Report : CS - TR - 2009 - 005 An Optimal Boundary - Fair Scheduling Algorithm for Multiprocessor Real - Time Systems ∗
Although the scheduling problem for multiprocessor real-time systems has been studied for decades, it is still an evolving research field with many open problems. In this work, focusing on periodic real-time tasks, we propose a novel optimal scheduling algorithm, namely boundary fair (Bfair), which follows the same line of research as the well-known Pfair scheduling algorithms and can also achi...
متن کاملAn Optimal Discrete-Time Based Boundary Fair Scheduler for Sporadic Tasks in Multiprocessor Real-Time Systems∗
Several optimal scheduling algorithms have been studied recently for various real-time tasks running on multiprocessor systems with continuous as well as discrete time. However, the existing optimal schedulers for sporadic tasks may incur very high scheduling overhead due to either excessive number of scheduling points (e.g., for the Pfair-like scheduler) or arbitrarily small allocation for tas...
متن کاملAn Efficient Dynamic Scheduling Algorithm For Multiprocessor Real-Time Systems
Many time-critical applications require predictable performance and tasks in these applications have deadlines to be met. In this paper, we propose an efficient algorithm for nonpreemptive scheduling of dynamically arriving real-time tasks (aperiodic tasks) in multiprocessor systems. A real-time task is characterized by its deadline, resource requirements, and worst case computation time on p p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2011
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2011.06.003